Fonte: Computers & Industrial Engineering. Unidade: EESC
Assuntos: SEQUENCIAÇÃO DA PRODUÇÃO, SCHEDULING, ENGENHARIA DE PRODUÇÃO
ABNT
MIYATA, Hugo Hissashi e NAGANO, Marcelo Seido. An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan. Computers & Industrial Engineering, v. 171, p. 1-25, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2022.108366. Acesso em: 16 maio 2024.APA
Miyata, H. H., & Nagano, M. S. (2022). An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan. Computers & Industrial Engineering, 171, 1-25. doi:10.1016/j.cie.2022.108366NLM
Miyata HH, Nagano MS. An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan [Internet]. Computers & Industrial Engineering. 2022 ; 171 1-25.[citado 2024 maio 16 ] Available from: https://doi.org/10.1016/j.cie.2022.108366Vancouver
Miyata HH, Nagano MS. An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan [Internet]. Computers & Industrial Engineering. 2022 ; 171 1-25.[citado 2024 maio 16 ] Available from: https://doi.org/10.1016/j.cie.2022.108366